Approximation algorithms

Results: 332



#Item
11Approximation Algorithms in the Successive Hitting Set Model Sabine Storandt1 Department of Computer Science, University of Freiburg (Germany)

Approximation Algorithms in the Successive Hitting Set Model Sabine Storandt1 Department of Computer Science, University of Freiburg (Germany)

Add to Reading List

Source URL: ad-publications.informatik.uni-freiburg.de

Language: English - Date: 2015-09-21 17:00:09
    12We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit

    We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit

    Add to Reading List

    Source URL: vision.soic.indiana.edu

    Language: English - Date: 2018-04-02 11:03:41
      13Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008

      Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008

      Add to Reading List

      Source URL: www.cs.cmu.edu

      - Date: 2008-01-21 16:09:45
        14Approximation Algorithms for Spectrum Allocation and Power Control in Wireless Networks

        Approximation Algorithms for Spectrum Allocation and Power Control in Wireless Networks

        Add to Reading List

        Source URL: darwin.bth.rwth-aachen.de

        - Date: 2012-10-08 09:57:58
          15Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Arora–Rao–Vazirani Approximation for Expansion In this lecture, we consider the problem of finding a set with smallest

          Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Arora–Rao–Vazirani Approximation for Expansion In this lecture, we consider the problem of finding a set with smallest

          Add to Reading List

          Source URL: sumofsquares.org

          - Date: 2016-11-17 19:44:26
            16Improved Approximation Algorithms for Box Contact Representations? Michael A. Bekos1 , Thomas C. van Dijk2 , Martin Fink2 , Philipp Kindermann2?? , Stephen Kobourov3 , Sergey Pupyrev3 , Joachim Spoerhase2 , and Alexander

            Improved Approximation Algorithms for Box Contact Representations? Michael A. Bekos1 , Thomas C. van Dijk2 , Martin Fink2 , Philipp Kindermann2?? , Stephen Kobourov3 , Sergey Pupyrev3 , Joachim Spoerhase2 , and Alexander

            Add to Reading List

            Source URL: www.cs.arizona.edu

              17Recent Advances in Approximation Algorithms Spring 2015 Lecture 17: Cheeger’s Inequality and the Sparsest Cut Problem Lecturer: Shayan Oveis Gharan

              Recent Advances in Approximation Algorithms Spring 2015 Lecture 17: Cheeger’s Inequality and the Sparsest Cut Problem Lecturer: Shayan Oveis Gharan

              Add to Reading List

              Source URL: homes.cs.washington.edu

              - Date: 2015-06-08 16:07:30
                18Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments Anke van Zuylen Institute for Theoretical Computer Science, Tsinghua University, Beijing, China

                Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments Anke van Zuylen Institute for Theoretical Computer Science, Tsinghua University, Beijing, China

                Add to Reading List

                Source URL: arvanzuijlen.people.wm.edu

                - Date: 2010-09-17 07:14:26
                  19Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Optimality of sum-of-squares In this lecture, we show that sum-of-squares achieves the best possible approximation guarantees for every constraint sati

                  Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Optimality of sum-of-squares In this lecture, we show that sum-of-squares achieves the best possible approximation guarantees for every constraint sati

                  Add to Reading List

                  Source URL: sumofsquares.org

                  - Date: 2016-11-30 18:56:07
                    20ARTICLE IN PRESS Journal of Computer and System Sciences–195 http://www.elsevier.com/locate/jcss Approximation algorithms for classes of graphs excluding

                    ARTICLE IN PRESS Journal of Computer and System Sciences–195 http://www.elsevier.com/locate/jcss Approximation algorithms for classes of graphs excluding

                    Add to Reading List

                    Source URL: users.uoa.gr

                    - Date: 2014-06-11 17:30:29